> Advanced Theory of Formal Languages and Automata
> 
> Okruhy budou nasledujici
> 
> 1. Introduction
> 
> 2. Finite Automata
> 2.1 Classical Theory of Finite Automata
> 2.2 New Variants of Finte Automata
> 
> 3. Context-free Grammars and Pushdown Automata
> 3.1 Classical Theory of Context-free Grammars
> 3.2 Classical Theory of Pushdown Automata
> 3.3 New Grammars Based on Context-Free Productions
> 3.4 New Variants of Pushdown Automta
> 
> 4. Turing Machines
> 4.1 Classical Theory of Turing Machines
> 4.2 New Characterizations of Recursively Enumerable Languages
> 
> 5. Language Operations
> 5.1  Classical Language Operations
> 5.2 New Language Operations
> 
> 6. Applications in Compilers
> 
> 7. Conclusion
> 
> Klasicke casti budou vesmes z IFJ a VYP, ktere zaslu.
